I'll also look briefly at the issue of operator precedence and generalize the treewalking code into a full-fledged recursive routine that's able to handle arbitrarily complex parse trees. 我还将简要地研究运算符优先级的问题,并将树遍历代码推广到成熟的递归例程中,该例程可以处理任意复杂的解析树。
The Hanoi tower question is used as an example to analyze the causes of slow operation of the recursive routine. A recursive algorithm based on array is presented. 以Hanoi塔问题为例,分析递归程序运行速度慢的原因,提出一种基于数组的递归算法。